Tree-based Algorithm to Find the k-th Value in Distributed Systems
نویسندگان
چکیده
In this paper, we study distributed algorithms for nding the k-th value in the decentralized systems. First we consider the case of circular con guration of processors where no processor knows the total number of participants. Later a network of arbitrary conguration is examined and a tree-based algorithm is proposed. The proposed algorithm requires O(N ) messages and O(logN ) rounds of message passing, where N is the number of nodes in the network.
منابع مشابه
Tree - based Algorithm to Find the k - th Value
In this paper, we study distributed algorithms for nding the k-th value in the decentralized systems. First we consider the case of circular connguration of processors where no processor knows the total number of participants. Later a network of arbitrary con-guration is examined and a tree-based algorithm is proposed. The proposed algorithm requires O(N) messages and O(logN) rounds of message ...
متن کاملTree - based Algorithm to Find the k - th Value in DistributedSystemsYoonsik
In this paper, we study distributed algorithms for nding the k-th value in the decentralized systems. First we consider the case of circular connguration of processors where no processor knows the total number of participants. Later a network of arbitrary con-guration is examined and a tree-based algorithm is proposed. The proposed algorithm requires O(N) messages and O(logN) rounds of message ...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملParticle swarm optimization for a bi-objective web-based convergent product networks
Here, a collection of base functions and sub-functions configure the nodes of a web-based (digital)network representing functionalities. Each arc in the network is to be assigned as the link between two nodes. The aim is to find an optimal tree of functionalities in the network adding value to the product in the web environment. First, a purification process is performed in the product network ...
متن کاملAn Optimization K-Modes Clustering Algorithm with Elephant Herding Optimization Algorithm for Crime Clustering
The detection and prevention of crime, in the past few decades, required several years of research and analysis. However, today, thanks to smart systems based on data mining techniques, it is possible to detect and prevent crime in a considerably less time. Classification and clustering-based smart techniques can classify and cluster the crime-related samples. The most important factor in the c...
متن کامل